An algorithm for the guillotine restrictions verification in a rectangular covering model
نویسنده
چکیده
We consider the Cutting and Covering problem with guillotine restrictions. In one of our previous works, we have shown the connection between the connex components of a graph representation for the covering model and the guillotine cuts. Based on this, in this paper we propose an algorithm which can be used to verify guillotine restrictions in a two-dimensional covering model. Key–Words: bidimensional covering problem, guillotine restrictions, conex components of a graph
منابع مشابه
An algorithm for determination of the guillotine restrictions for a rectangular cutting-stock pattern
Starting from a two-dimensional rectangular Cutting-Stock pattern with gaps, this paper is focuses on the problem of determination if the pattern is with guillotine restrictions or not and proposes an algorithm for solving it. First we present two new graph representations of the cutting pattern, weighted graph of downward adjacency and weighted graph of rightward adjacency. Using these represe...
متن کاملCovering with Rectangular Pieces
The practical problem we are trying to model is: we have to cover a room with a material(carpet or linolleum). This material is in a roll of fixed width. We want to cover the room with a minimum number of pieces and to waste a minimum amount of material. We present in this paper a synthesis of our works. We can easily see that the two criteria, the minimum loss of material and the minimumnumber...
متن کاملContext-free grammar for a two-dimensional language
We describe in this paper a context-free grammar, with parameters, that generate models for covering a rectangular area with many smaller rectangular pieces. The generated language contains all the models that can be generated using only guillotine restrictions. The grammar was inspired by the practical problem of covering a rectangular room with carpet or linoleum. The source of rectangular pi...
متن کاملThe determination of the guillotine restrictions for a rectangular cutting-stock pattern
We consider a two-dimensional rectangular Cutting-Stock problem in case of a cutting pattern with gaps. First we present two new graph representations of the cutting pattern, weighted graph of downward adjacency and weighted graph of rightward adjacency. Using this kind of representation we propose a method to verify guillotine restrictions of the pattern which can be applied for cutting-stock ...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کامل